An individual manipulability of positional voting rules
نویسندگان
چکیده
منابع مشابه
Exact results on manipulability of positional voting rules
We consider 3-candidate elections under a general scoring rule and derive precise conditions for a given voting situation to be strategically manipulable by a given coalition of voters. We present an algorithm that makes use of these conditions to compute the minimum size M of a manipulating coalition for a given voting situation. The algorithm works for any voter preference model — here we pre...
متن کاملManipulability Comparisons of Positional Voting Rules for Large Three-Candidates Elections
Given any positional voting rule (PVR), a characterization of unstable voting situations is provided for three-candidate elections with large electorates. Our contribution to this literature concerns three aspects: (i) a comparison of PVRs via set inclusion of their corresponding sets of unstable voting situations; (ii) a full classification of PVRs according to their vulnerability to coalition...
متن کاملThe Manipulability of Voting Systems
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Mathematical Association of America is collaborating with ...
متن کاملAnonymous voting and minimal manipulability
We compare the manipulability of different choice rules by considering the number of manipulable profiles. We establish the minimal number of such profiles for tops-only, anonymous, and surjective choice rules, and show that this number is attained by unanimity rules with status quo.
متن کاملAn Empirical Study of the Manipulability of Single Transferable Voting
Voting is a simple mechanism to combine together the preferences of multiple agents. Agents may try to manipulate the result of voting by mis-reporting their preferences. One barrier that might exist to such manipulation is computational complexity. In particular, it has been shown that it is NP-hard to compute how to manipulate a number of different voting rules. However, NP-hardness only boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SERIEs
سال: 2011
ISSN: 1869-4187,1869-4195
DOI: 10.1007/s13209-011-0050-y